The Jordan canonical form

نویسنده

  • Attila Máté
چکیده

4 The minimal polynomial of a linear transformation 7 4.1 Existence of the minimal polynomial . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 The minimal polynomial for algebraically closed fields . . . . . . . . . . . . . . . . . 8 4.3 The characteristic polynomial and the Cayley–Hamilton theorem . . . . . . . . . . . 9 4.4 Finding the minimal polynomial . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinite-dimensional versions of the primary, cyclic and Jordan decompositions

The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.

متن کامل

NUROP Congress Paper Jordan Canonical Forms of Linear Operators

Any linear transformation can be represented by its matrix representation. In an ideal situation, all linear operators can be represented by a diagonal matrix. However, in the real world, there exist many linear operators that are not diagonalizable. This gives rise to the need for developing a system to provide a beautiful matrix representation for a linear operator that is not diagonalizable....

متن کامل

Computational Aspects of the Jordan Canonical Form

In this paper we discuss algorithmic aspects of the computation of the Jordan canonical form. Inspired by the Golub & Wilkinson paper 9] on the computation of the Jordan canonical form, an O(n 3) algorithm was developed by Beelen & Van Dooren 3] for computing the Kronecker structure of an arbitrary pencil B ? A. Here we show how the ideas of this algorithm lead to a special algorithm for recons...

متن کامل

Lecture 4: Jordan Canonical Forms

This lecture introduces the Jordan canonical form of a matrix — we prove that every square matrix is equivalent to a (essentially) unique Jordan matrix and we give a method to derive the latter. We also introduce the notion of minimal polynomial and we point out how to obtain it from the Jordan canonical form. Finally, we make an encounter with companion matrices. 1 Jordan form and an applicati...

متن کامل

On the computation of the Jordan canonical form of regular matrix polynomials

In this paper, an algorithm for the computation of the Jordan canonical form of regular matrix polynomials is proposed. The new method contains rank conditions of suitably defined block Toeplitz matrices and it does not require the computation of the Jordan chains or the Smith form. The Segré and Weyr characteristics are also considered.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017